/**
 * Copyright (c) 2008 ubermath
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are
 * met:
 *
 * * Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 *
 * * Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 *
 * * Neither the name of 'ubermath' nor the names of its contributors 
 *   may be used to endorse or promote products derived from this software 
 *   without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 *
 * Created: Aug 26, 2008
 */
package com.googlecode.ubermath;

import java.util.Arrays;

/**
 * @author Rebecca Hicks
 */
public class EquationSolver extends MatrixOperations {
	
	public static final float[][] solve(float[][] equation) {
		float[][] matrix = Arrays.copyOf(equation, equation.length);
		
		int i = 0;
		
		//solves matrix, ignoring final column
		for (int row = 0; row < matrix.length; row++) {
			for (int col = i; col < (matrix[row].length - 1); col++) {
				int temp = findNonzero(matrix, row, col);
				if (temp == -1) {
					i++;
				} else {
					if (row != temp) {
						swapRow(matrix, row, temp);
					}
					if (matrix[row][col] != 1) {
						divideRow(matrix, row, col);
					}
					eliminate(matrix, row, col);
					i++;
					break;
				}
			}
		}
		return matrix;
	}
}